Many-to-One Packed Routing via Matchings
نویسندگان
چکیده
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham 1]. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an eecient algorithm for many-to-one routing on an trees (and therefore any graph). Finally, we give bounds for routing arbitrary relations in this model.
منابع مشابه
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a framework which makes the analysis simple and local.
متن کاملRouting and Sorting Via Matchings On Graphs
The paper is divided in to two parts. In the first part we present some new results for the routing via matching model introduced by Alon et al [5]. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph G with vertices labeled fr...
متن کاملNew Results on Routing via Matchings on Graphs
In this paper we present some new complexity results on the routing time of a graph under the routing via matching model. This is a parallel routing model which was introduced by Alon et al[1]. The model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data (pebbles) with its matched partner...
متن کاملMany-to-Many Routing on Trees via Matchings
In this paper we present an extensive study of many-to-many routing on trees under the matching routing model. Our study includes on-line and off-line algorithms. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k 1) + d f dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distan...
متن کاملRouting Number Of A Pyramid
In this short note we give the routing number of pyramid graph under the routing via matching model introduced by Alon et al [5]. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph G with vertices labeled from [1, ..., n] and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997